#include "longestValidParentheses.h"
int longestValidParentheses(std::string s) {
    if (s.empty())
        return 0;
    const int n = s.size();
    char c;
    std::stack<int> op;
    int count = 0;
    int max_result = 0;
    for (int i = 0; i < n; i++) {
        c = s[i];
        if (c == '(') {
            op.push('(');
        } else if (c == ')') {
            while (op.top() == '(') {
            }
        }
    }
}
